A Graph-Theoretic Visualization Approach to Network Risk Analysis
نویسندگان
چکیده
This paper describes a software system that provides significant new capabilities for visualization and analysis of network attack graphs produced through Topological Vulnerability Analysis (TVA). The TVA approach draws on a database of known exploits and system vulnerabilities to provide a connected graph representing possible cyber-attack paths within a given network. Our visualization approach builds on the extensive functionality of the yWorks suite of graphing tools, providing customized new capabilities for importing, displaying, and interacting with large scale attack graphs, to facilitate comprehensive network security analysis. These visualization capabilities include clustering of attack graph elements for reducing visual complexity, a hierarchical dictionary of attack graph elements, high-level overview with detail drilldown, interactive on-graph hardening of attacker exploits, and interactive graph layouts. This new visualization system is an integrated component of the CAULDRON attack graph tool developed at George Mason University.
منابع مشابه
Study of Systemic risk in the banking sector of Tehran Stock Exchange: Graph theory approach and ARMA-gjrGARCH-DCC
Banking systems are critical to economies, and their influence is significantly stronger in Iran. As a result, fragility in the country's financial system and the emergence of systemic risks in the banking system undermine the economy's stability and performance. Due to the importance of systemic risk in the banking network, this study examines the factors affecting the occurrence of systemic r...
متن کاملA module theoretic approach to zero-divisor graph with respect to (first) dual
Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملConsidering chain to chain competition in forward and reverse logistics of a dynamic and integrated supply chain network design problem
In this paper, a bi-objective model is presented for dynamic and integrated network design of a new entrant competitive closed-loop supply chain. To consider dynamism and integration in the network design problem, multiple long-term periods are regarded during planning horizon, so that each long-term period includes several short-term periods. Furthermore, a chain to chain competition between t...
متن کاملCompetitive Pricing in a Supply Chain Using a Game Theoretic Approach
We develop a price competition model for a new supply chain that competes in a market comprised of some rival supply chains. The new supply chain has one risk-neutral manufacturer and one risk-averse retailer in which the manufacturer is a leader and retailer is a follower. The manufacturer pays a fraction of the risk cost (caused by demand uncertainty) to the retailer. We apply this competitiv...
متن کامل